Functional centrality in graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

متن کامل

Testing Centrality in Random Graphs

When testing centrality in random graphs it is of importance to specify models that capture the irregularities in the structure due to centrality. In this paper we propose using the well-known block models in an attempt to capture such irregularities. The baseline model, revealing no centrality structure, used in this paper is the Bernoulli model. It is shown that the maximum likelihood estimat...

متن کامل

Attachment Centrality for Weighted Graphs

Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity. Unfortunately, the Attachment Centrality is defined only for unwei...

متن کامل

Closeness Centrality Extended To Unconnected Graphs : The Harmonic Centrality Index

Social network analysis is a rapid expanding interdisciplinary field, growing from work of sociologists, physicists, historians, mathematicians, political scientists, etc. Some methods have been commonly accepted in spite of defects, perhaps because of the rareness of synthetic work like (Freeman, 1978; Faust & Wasserman, 1992). In this article, we propose an alternative index of closeness cent...

متن کامل

Efficient Centrality Monitoring for Time-Evolving Graphs

The goal of this work is to identify the nodes that have the smallest sum of distances to other nodes (the lowest closeness centrality nodes) in graphs that evolve over time. Previous approaches to this problem find the lowest centrality nodes efficiently at the expense of exactness. The main motivation of this paper is to answer, in the affirmative, the question, ‘Is it possible to improve the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2007

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081080601002221